package job.zijie;

import java.util.Scanner;

/**
 * @author wq
 */
public class YeZiJieDianGeshu {
    public static void main(String[] args) {
        /*
        3
        1 2 3
        2 1 3
        * */
        Scanner scanner=new Scanner(System.in);
        int n=scanner.nextInt();
        int[] preOrder=new int[n];
        int[] midOrder=new int[n];
        int[] tree=new int[n];

        for(int i=0;i<n;i++){//前序
            preOrder[i]=scanner.nextInt();
        }

        for(int i=0;i<n;i++){//中序
            midOrder[i]=scanner.nextInt();
        }

    }
    public static int[] buildTree(int[] preOrder,int pbegin,int pend,int[] midOrder,int mbegin,int mend,int[] tree,int n){
        return null;
    }
}
